Walk entropies in graphs
نویسندگان
چکیده
Article history: Received 25 October 2013 Accepted 9 November 2013 Available online 25 November 2013 Submitted by R. Brualdi MSC: 05C50 05C81 05C76
منابع مشابه
Discrete-Time Quantum Walks and Graph Structures
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total entropies of the average mixing matrices for some cubic graphs. The trace captures how likely a quantum walk is to revisit the state it started with, and the...
متن کاملA note on walk entropies in graphs
Article history: Received 15 November 2013 Accepted 9 December 2013 Available online 27 December 2013 Submitted by R. Brualdi MSC: 05C50 15A16 82C20
متن کاملA Graph Embedding Method Using the Jensen-Shannon Divergence
Riesen and Bunke recently proposed a novel dissimilarity based approach for embedding graphs into a vector space. One drawback of their approach is the computational cost graph edit operations required to compute the dissimilarity for graphs. In this paper we explore whether the Jensen-Shannon divergence can be used as a means of computing a fast similarity measure between a pair of graphs. We ...
متن کاملGeneralized Degree-Based Graph Entropies
Inspired by the generalized entropies for graphs, a class of generalized degree-based graph entropies is proposed using the known information-theoretic measures to characterize the structure of complex networks. The new entropies depend on assigning a probability distribution about the degrees to a network. In this paper, some extremal properties of the generalized degree-based graph entropies ...
متن کاملSome New Properties for Degree-Based Graph Entropies
The graph entropies inspired by Shannon’s entropy concept become the information-theoretic quantities for measuring the structural information of graphs and complex networks. In this paper, we continue studying some new properties of the graph entropies based on information functionals involving vertex degrees. We prove the monotonicity of the graph entropies with respect to the power exponent....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013